12 research outputs found

    EDOCR: ENERGY DENSITY ON-DEMAND CLUSTER ROUTING IN WIRELESS SENSOR NETWORKS

    Get PDF
    Energy management is one of the critical parameters in Wireless Sensor Networks. In this paper we attempt for a solution to balance the energy usage for maximizing the network lifetime, increase the packet delivery ratio and throughput. Our proposed algorithm is based on Energy Density of the clusters in Wireless Sensor Networks. The cluster head is selected using two step method and on-demand routing approach to calculate the balanced energy shortest path from source to sink. This unique approach maintains the balanced energy utilization among all nodes by selecting the different cluster heads dynamically. Our simulation results have compared with one of the plain routing scheme (EBRP) and cluster based routing (TSCHS), which shows the significant improvements in minimizing the delay and energy utilization and maximizing the network lifetime and throughput with respect to these works

    MIPSOE–Markov Integrated PSO Encryption Algorithm for Secure Data Aggregation

    Get PDF
    Various clustering algorithm exists in Wireless Sensor Networks concerned on balancing energy utilization. Many research issues deviate towards the formation of clusters based on energy, distance, and another sensor node’s resource parameters. In this article, the proposed protocol is composed of two phases. In the first phase, clusters are formed based on Particle Swarm Optimization and Markov’s Random Field mathematical calculation. The second phase generates a key, where the secret key is used for encryption technique. The proposed protocol is implemented in the NS2 simulator. When comparing the existing protocol with the proposed MIPSOE protocol it is inferred that there is an improvement in terms of network lifetime, throughput, delay, and packet delivery ratio

    STEAR: Secure Trust-Aware Energy-Efficient Adaptive Routing in Wireless Sensor Networks

    Get PDF
    Secure communication is one of the most critical challenging tasks in multi-hop Wireless Sensor Networks (WSNs). Routing protocols of WSNs are highly susceptible to various attacks, which replay the routing information through the malicious node and steal the identities of the valid nodes in a network. The malicious nodes forward the packets far away from the sink, increasing the packet drop ratio, that sluggishes overall network efficiency. In order to overcome this problem, we have designed and implemented a secure trust aware energy efficient adaptive routing (STEAR) for dynamic WSNs. This protocol provides secure, trustworthy and energy efficient routing for multihop networks. STEAR is designed with effective mechanisms to identify the malicious nodes using dynamic secret key (DSK) assignment, trust and energy monitoring, and packets flow status monitoring. Simulation results show that network efficiency and throughput are better and packet drop ratio is reduced compared to earlier works

    CADR : Congestion Alleriation using Distance Based Routing in Wireless Sensor Networks

    Get PDF
    Congestion degrades the overall network performance in WSNs and it can min-imize the throughput of the network due to the large packet drop, increased energy consumption and end-to-end delay. Even though most of the proposed congestion control schemes reduce traffic rate, they affect the fidelity level re-quired by the applications. In this paper, we propose an algorithm Congestion Alleviation using Distance based Routing (CADR) technique, where the bursty traffic is diverted towards the sink via the nodes whose queue length is below the threshold and is at minimum distance from the sink. The residual energy and the depth of the nodes are additional parameters which supports congestion mitigation. Simulation results show that the overall throughput of the network has tremendously improves for large and dense wireless sensor networks when compared to the earlier works

    A Survey on Energy Efficient Routing Protocols in Wireless Sensor Networks

    Get PDF
    Energy efficiency is one of the critical issues in the Wireless Sensor Networks (WSNs), since sensor devices are tiny and integrated with a limited capacity battery. In most of the advanced applications, WSNs operate in very harsh areas and not under supervision of human controls. Routing protocols play a significant role in energy balancing by incorporating the techniques that can reduce control overhead, proper data aggregation method and feasible path selection. It demands a unique requirement due to its frequent topology changes and distributive nature. One of the major concerns in the design of routing protocol in WSNs is efficient energy usage and prolonging Network lifetime. This paper mainly discusses different issues related to energy efficiency in routing protocols of all categories. It incorporates most recent routing protocols which improves the energy efficiency in various application environments. This paper also provides comprehensive details of each protocol which emphasize their principles and explore their advantages and limitations. These protocols belong to different classifications based on Network Structures, communication model, topology and QoS parameters. It also includes more relevant and prominent comparisons with all recent State-of-Art works

    MCDR: Mitigating Congestion using Distance based Routing in Wireless Sensor Networks

    Get PDF
    The network performance in WSNs is mainly affected by the congestion due to bursty traffic. Congestion can cause large packet drops, increased energy consumption and latency. Different traffic rate control mechanisms have proposed to mitigate congestion and most of these mechanisms are greatly affecting the fidelity requirement of the applications. In this paper, we proposed an algorithm named, Mitigating Congestion using Distance based Routing (MCDR) technique to mitigate congestion. This technique has successfully reduced congestion by scattering the traffic through the nodes which are placed at comparatively minimum distance from the sink and whose Queue Length is below the threshold value. The Residual Energy and Depth are two added parameters to strengthen the scattering decision. Simulation results shows that the network throughput has significantly improved with minimized latency due to the reduction of loops when compared to previous works

    MEGOR: Multi-constrained Energy efficient Geographic Opportunistic Routing in Wireless Sensor Network

    Get PDF
    Providing better energy efficient network is the important critical issues in Wireless Sensor Networks. We presented Multi-constrained Energy efficient Geographic Opportunistic Routing algorithm that enhance the network lifetime based on efficient Geographic Opportunistic Routing. Geographic Opportunistic Routing algorithm uses single path multi hop routing technique in which packets are effectively routed from source to the sink node in a given geographical region. Proposed algorithm is devised with unique parameters viz., Single hop Packet Progress, Packet Reception Ratio, Residual Energy and Energy Density to select intermediate next nodes to forward the packet to sink node. The MEGOR exhibits better results in terms of delay, reliability, energy efficiency and network lifetime when compared with earlier state_of_art works

    EBDRA: energy balanced dynamic cluster routing approach for WSN

    No full text
    Density of nodes deployed in WSNs is based on application requirements. The redundant data collection in dense network results in more energy consumption. The Data Routing In-Network Aggregation (DRINA) is one of the recent algorithm proposed to reduce energy consumption in dense network environment by minimizing the number of communications from source to sink. Here the Data transmission is carried out by using data aggregation in cluster based environment using shortest path method. But due to inefficient cluster head selection technique, it is unable to mange cluster head failures and evades the energy drain in sensor nodes along the common static path that leads network partition. In order to overcome these problems we proposed an algorithm known as Energy Efficient Routing using Dynamic Cluster approach (EBDRA), that includes efficient cluster head selection technique and dynamic
    corecore